comput scienc graph abstract data structur meant implement graph concept mathemat graph data structur consist finit possibl mutabl set order pair call edg arc entiti call node vertic mathemat edg point node part graph structur extern entiti repres integ indic refer graph data structur associ edg edg symbol label numer attribut cost capac length content hide oper represent algorithm refer read extern link edit operationsth basic oper provid graph data structur includ adjac test edg node node neighbor list node edg add add edg delet remov edg node return node set node set node structur associ valu edg provid edg return edg set edg set edg edit representationsdiffer data structur represent graph practic adjac list adjac list implement arrai list list destin node sourc node incid list variant adjac list descript edg cost addit edg adjac matrix dimension boolean matrix row column repres sourc destin vertic entri matrix edg exist vertic row column incid matrix dimension boolean matrix row repres vertic column repres edg arrai entri relat incid adjac list gener prefer effici repres spars graph adjac matrix prefer graph dens number edg close number vertic squar quickli edg connect vertic graph regular placement edg symbol graph choic represent edit algorithmsgraph algorithm signific field interest comput scienc typic higher level oper graph find path node depth search breadth search find shortest path node dijkstra algorithm solut find shortest path node node exist form floyd warshal algorithm direct graph flow network edg capac edg receiv flow ford fulkerson algorithm find maximum flow sourc sink graph mathemat graph abstract represent set object pair object connect link interconnect object repres mathemat abstract call vertic link connect pair vertic call edg typic graph depict diagrammat form set dot vertic join line curv edg graph object studi discret mathemat edg direct asymmetr undirect symmetr vertic repres peopl parti edg peopl shake hand undirect graph person shook hand person person shook hand person hand vertic repres peopl parti edg person person person person graph direct know necessarili symmetr relat person know person necessarili impli revers fan celebr celebr fan type graph call direct graph edg call direct edg arc contrast graph edg direct call undirect vertic call node point edg call line graph basic subject studi graph theori word graph sens jame joseph sylvest content hide definit graph adjac relat type graph distinct term main definit undirect graph direct graph mix graph multigraph simpl graph weight graph half edg loos edg import graph class regular graph complet graph finit infinit graph graph class term connect properti graph exampl import graph oper graph gener note refer extern link edit definitionsdefinit graph theori vari basic wai defin graph relat mathemat structur edit graph gener graph pseudograph vertic edg common sens term graph order pair compris set vertic node set edg line element subset edg relat vertic relat repres unord pair vertic respect edg avoid ambigu type graph precis undirect simpl sens graph stem concept edg set gener notion set relat incid associ edg vertic gener notion multiset unord pair necessarili distinct vertic author call type object multigraph pseudograph variant fulli vertic belong edg call end endpoint end vertic edg vertex exist graph belong edg finit result true infinit graph argument fail infinit case order graph number vertic graph size number edg degre vertex number edg connect edg connect vertex end loop count edg graph theorist shorter notat uv edit adjac relationth edg undirect graph induc symmetr binari relat call adjac relat specif edg vertic adjac denot edit type graph edit distinct term main definitiona state context defin term graph degre gener draw strict distinct term commonli modern text graph theori state graph mean undirect simpl finit graph definit edit undirect grapha graph edg orient order pair set multiset vertic edit direct graph direct graph main articl digraph mathemat direct graph digraph order pair set element call vertic node set order pair vertic call arc direct edg arrow arc consid direct call head call tail arc direct successor direct predecessor path lead successor reachabl predecessor arc call arc invert direct graph call symmetr arc invert arc belong symmetr loopless direct graph equival simpl undirect graph pair invers arc correspond edg edg number half number arc variat definit orient graph arc edit mix grapha mix graph graph edg direct undirect written order tripl defin direct undirect graph special case edit multigrapha loop edg direct undirect start end vertex permit permit applic context edg end call link term multigraph gener understood multipl edg loop allow graph defin loop multipl edg multigraph defin graph loop graph defin disallow loop multipl edg term defin graph multipl edg loop term pseudograph mean edit simpl graph simpl graph vertic edg vertex degre regular graph oppos multigraph simpl graph undirect graph loop edg vertic simpl graph edg graph form set multiset edg pair distinct vertic simpl graph vertic vertex degre convers true exist simpl graph vertic vertex degre smaller edit weight grapha graph weight graph number weight assign edg weight repres cost length capac depend problem weight graph sum weight edg edit half edg loos edgesin except situat edg end call half edg end loos edg sign graph bias graph edit import graph class edit regular graphmain articl regular graph regular graph graph vertex number neighbor vertex degre valenc regular graph vertic degre call regular graph regular graph degre edit complet graph complet graph vertic vertex edg vertex main articl complet graph complet graph featur pair vertic edg connect edit finit infinit graphsa finit graph graph finit set infinit graph infinit set vertic edg commonli graph theori impli graph discuss finit graph infinit specif state edit graph class term connectivitymain articl connect graph theori undirect graph vertic call connect path call disconnect graph call connect pair distinct vertic graph connect call disconnect graph call vertex connect edg connect set vertic edg exist disconnect graph vertex connect graph call simpli connect direct graph call weakli connect replac direct edg undirect edg produc connect undirect graph strongli connect strong direct path direct path pair vertic edit properti graphsse glossari graph theori graph properti edg graph call adjac coincid share common vertex arrow direct graph call consecut head nock notch end similarli vertic call adjac share common edg consecut notch head arrow case common edg join vertic edg vertex edg call incid graph vertex edg call trivial graph graph vertic edg edgeless graph graph vertic edg call null graph empti graph terminolog consist mathematician object weight graph digraph edg various call cost weight length term depend applic graph aris context optim rout problem travel salesman problem vertic graph natur element set distinguish kind graph call vertex label question treat vertic indistinguish graph call unlabel vertic distinguish properti graph number incid edg remark appli edg graph label edg call edg label graph graph label attach edg vertic gener design label graph vertic indistinguish edg indistinguish call unlabel note literatur term label appli kind label serv distinguish vertic edg edit exampl graph node diagram graphic represent graph categori theori small categori repres direct multigraph object categori repres vertic morphism direct edg functor categori induc necessarili digraph morphism graph comput scienc direct graph repres knowledg conceptu graph finit state machin discret structur binari relat set defin direct graph element direct predecessor element iff xry edit import graphsbas exampl complet graph pair vertic join edg graph edg bipartit graph vertex set partit set vertic adjac vertic adjac altern graph chromat number complet bipartit graph vertex set union disjoint set vertex adjac vertex edg linear graph path graph length vertic list order vn edg vi vi linear graph occur subgraph graph path graph cycl graph length vertic name vn edg vi vi addit vnv cycl graph character connect regular graph cycl graph occur subgraph graph cycl circuit graph planar graph graph vertic edg drawn plane edg intersect embed plane tree connect graph cycl forest graph cycl disjoint union tree advanc kind graph petersen graph gener perfect graph cograph graph larg automorph group vertex transit arc transit distanc transit graph strongli regular graph gener distanc regular graph edit oper graphsmain articl oper graph oper produc graph classifi categori elementari oper call edit oper graph creat graph origin simpl local chang addit delet vertex edg merg split vertic graph rewrit oper replac occurr pattern graph host graph instanc replac graph unari oper creat significantli graph exampl line graph dual graph complement graph binari oper creat graph initi graph exampl disjoint union graph cartesian product graph tensor product graph strong product graph lexicograph product graph edit generalizationsin hypergraph edg join vertic undirect graph simplici complex consist simplic edg simplic vertic complex gener graph higher dimension simplic graph rise matroid model theori graph structur case limit number edg cardin number continu graph comput biologi power graph analysi introduc power graph altern represent undirect graph edit alsodu graph glossari graph theori graph data structur graph databas graph draw graph theori public list graph theori topic network theori conceptu graph horizont constraint graph causal dynam triangul sage math softwar networkx softwar mathemat comput scienc graph theori studi graph mathemat structur model pairwis relat object collect graph context refer collect vertic node collect edg connect pair vertic graph undirect mean distinct vertic edg edg direct vertex graph mathemat detail definit variat type graph commonli consid graph studi graph theori confus graph function kind graph graph prime object studi discret mathemat refer glossari graph theori basic definit graph theori content hide histori draw graph graph theoret data structur list structur matrix structur problem graph theori enumer subgraph induc subgraph minor graph color rout problem network flow visibl graph problem cover problem graph class applic relat topic algorithm subarea relat area mathemat gener promin graph theorist note refer extern link onlin textbook resourc edit histori nigsberg bridg problemth paper written leonhard euler bridg nigsberg publish regard paper histori graph theori paper written vandermond knight problem carri analysi situ initi leibniz euler formula relat number edg vertic face convex polyhedron studi gener cauchi huillier origin topolog centuri euler paper bridg nigsberg list introduc topolog caylei led studi analyt form aris differenti calculu studi class graph tree studi implic theoret chemistri involv techniqu concern enumer graph properti enum graph theori rose result caylei fundament result publish lya gener de bruijn caylei link result tree contemporari studi chemic composit fusion idea come mathemat come chemistri origin part standard terminolog graph theori term graph introduc sylvest paper publish natur draw analog quantic invari variant algebra molecular diagram invari variant express graph precis ident kekul diagram chemicograph give rule geometr multipl graph construct graph product variant separ graph ital origin famou product problem graph theori color problem true map drawn plane region color color region common border color problem pose franci guthri written record letter de morgan address hamilton year incorrect proof propos includ caylei kemp studi gener problem tait heawood ramsei hadwig led studi color graph embed surfac arbitrari genu tait reformul gener class problem factor problem studi petersen nig work ramsei color special result obtain tur origin branch graph theori extrem graph theori color problem remain unsolv centuri heinrich heesch publish method solv problem comput comput aid proof produc kenneth appel wolfgang haken make fundament notion discharg develop heesch proof involv check properti configur comput fulli accept time due complex simpler proof configur twenti year robertson seymour sander thoma autonom develop topolog fertil graph theori back work jordan kuratowski whitnei import factor common develop graph theori topolog techniqu modern algebra work physicist gustav kirchhoff publish kirchhoff circuit law calcul voltag current electr circuit introduct probabilist method graph theori studi erd nyi asymptot probabl graph connect gave rise branch random graph theori fruit sourc graph theoret result edit draw graphsmain articl graph draw graph repres graphic draw dot circl vertex draw arc vertic connect edg graph direct direct draw arrow graph draw confus graph abstract visual structur wai structur graph draw matter vertic connect edg exact layout practic difficult decid draw repres graph depend problem domain layout suit easier understand edit graph theoret data structuresmain articl graph data structur wai store graph comput system data structur depend graph structur algorithm manipul graph theoret distinguish list matrix structur concret applic structur combin list structur prefer spars graph smaller memori requir matrix structur hand provid faster access applic consum huge amount memori edit list structuresincid list edg repres arrai pair tupl direct vertic edg connect possibl weight data vertic connect edg adjac adjac list incid list vertex list vertic adjac redund undirect graph vertic adjac adjac list list adjac queri faster cost extra storag space edit matrix structuresincid matrix graph repres matrix size number vertic number edg entri vertex edg edg endpoint data simplest case incid incid adjac matrix matrix number vertic graph edg vertex vertex element ax gener number xy edg comput matrix make easi find subgraph revers direct graph laplacian matrix kirchhoff matrix admitt matrix defin diagon degre matrix explicitli adjac inform degre inform similar matric call laplacian matric graph distanc matrix symmetr matrix element dx length shortest path path dx infin deriv power edit problem graph theori edit enumerationther larg literatur graphic enumer problem count graph meet condit work found harari palmer edit subgraph induc subgraph minorsa common problem call subgraph isomorph problem find fix graph subgraph graph reason interest question graph properti hereditari subgraph mean graph properti subgraph find maxim subgraph kind np complet problem find largest complet graph call cliqu problem np complet similar problem find induc subgraph graph import graph properti hereditari respect induc subgraph mean graph properti induc subgraph find maxim induc subgraph kind np complet find largest edgeless induc subgraph independ set call independ set problem np complet problem minor contain problem find fix graph minor graph minor subcontract graph graph obtain take subgraph contract edg graph properti hereditari minor mean graph properti minor famou graph planar minor complet bipartit graph cottag problem complet graph class problem extent speci gener graph determin point delet subgraph reconstruct conjectur edit graph coloringmani problem wai color graph color theorem strong perfect graph theorem erd faber lov sz conjectur unsolv total color conjectur unsolv list color conjectur unsolv hadwig conjectur graph theori unsolv edit rout problemshamiltonian path cycl problem minimum span tree rout inspect problem call chines postman problem bridg nigsberg shortest path problem steiner tree cottag problem travel salesman problem np complet edit network flowther numer problem aris applic notion flow network max flow min cut theorem edit visibl graph problemsmuseum guard problem edit cover problemscov problem specif instanc subgraph find problem tend close relat cliqu problem independ set problem set cover problem vertex cover problem edit graph classesmani problem involv character member class graph overlap significantli type list type problem includ instanc enumer member class character class term forbidden substructur ascertain relationship class properti graph impli find effici algorithm decid membership class find represent member class edit applicationsgraph ubiquit model natur human made structur model type relat process dynam physic biolog social system problem practic interest repres graph comput scienc graph repres network commun data organ comput devic flow comput practic link structur websit repres direct graph vertic web page websit direct edg page page exist link similar approach problem travel biologi comput chip design field develop algorithm handl graph major interest comput scienc transform graph formal repres graph rewrit system directli properti rewrit system confluenc studi complementari graph transform system focuss rule base memori manipul graph graph databas gear transact safe persist store queri graph structur data graph theoret method form proven linguist natur languag lend discret structur tradition syntax composit semant follow tree base structur express power li principl composition model hierarch graph lexic semant appli comput model word mean easier word understood term relat word semant network import comput linguist method phonolog optim theori lattic graph morpholog finit state morpholog finit state transduc common analysi languag graph us area mathemat linguist born organ textgraph net project wordnet verbnet graph theori studi molecul chemistri physic condens matter physic dimension structur complic simul atom structur studi quantit gather statist graph theoret properti relat topolog atom franzblau shortest path sp ring chemistri graph make natur model molecul vertic repres atom edg bond approach comput process molecular structur rang chemic editor databas search statist physic graph repres local connect interact part system dynam physic process system graph theori wide sociolog measur actor prestig explor diffus mechan notabl social network analysi softwar likewis graph theori biologi conserv effort vertex repres region speci exist habitat edg repres migrat path movement region inform import breed pattern track spread diseas parasit movement affect speci mathemat graph geometri part topolog knot theori algebra graph theori close link group theori graph structur extend assign weight edg graph graph weight weight graph repres structur pairwis connect numer valu graph repres road network weight repres length road digraph weight edg context graph theori call network network analysi practic applic model analyz traffic network applic network analysi split broadli categori analysi determin structur properti network distribut vertex degre diamet graph vast number graph measur exist product domain remain activ area research analysi find measur quantiti network transport network level vehicular flow portion analysi dynam properti network edit alsogalleri name graph glossari graph theori list graph theori topic public graph theori edit relat topicsgraph properti algebra graph theori conceptu graph data structur disjoint set data structur entit graph existenti graph graph data structur graph algebra graph automorph graph color graph databas graph draw graph equat graph rewrit intersect graph logic graph loop null graph pebbl motion problem perfect graph quantum graph spectral graph theori strongli regular graph symmetr graph tree data structur edit algorithmsbellman ford algorithm dijkstra algorithm ford fulkerson algorithm kruskal algorithm nearest neighbour algorithm prim algorithm depth search breadth search edit subareasalgebra graph theori geometr graph theori extrem graph theori probabilist graph theori topolog graph theori edit relat area mathematicscombinator group theori knot theori ramsei theori edit generalizationshypergraph abstract simplici complex 